TKSE: Trustworthy keyword search over encrypted data with two-side verifiability via blockchain

AXA Research Fund Singapor

Contour error compensation based on feed rate adjustment

To improve the performance of computer numerical control (CNC) machining, especially for large-curvature trajectories, this paper presents a contour error compensation algorithm based on reference trajectory modification. In order to estimate the contour error accurately and efficiently, a contour error estimation model is established. The reference trajectory is modified on the basis of the estimated contour error and partitioned into different segments, which adopt different feed rates according to a corner detection algorithm. The effectiveness of this contour error compensation algorithm is verified by experiments on a CNC machine tool

Anonymous privacy-preserving task matching in crowdsourcing

With the development of sharing economy, crowdsourcing as a distributed computing paradigm has become increasingly pervasive. As one of indispensable services for most crowdsourcing applications, task matching has also been extensively explored. However, privacy issues are usually ignored during the task matching and few existing privacy-preserving crowdsourcing mechanisms can simultaneously protect both task privacy and worker privacy. This paper systematically analyzes the privacy leaks and potential threats in the task matching and proposes a single-keyword task matching scheme for the multirequester/multiworker crowdsourcing with efficient worker revocation. The proposed scheme not only protects data confidentiality and identity anonymity against the crowd-server, but also achieves query traceability against dishonest or revoked workers. Detailed privacy analysis and thorough performance evaluation show that the proposed scheme is secure and feasible

SybMatch: Sybil detection for privacy-preserving task matching in crowdsourcing

The past decade has witnessed the rise of crowdsourcing, and privacy in crowdsourcing has also gained rising concern in the meantime. In this paper, we focus on the privacy leaks and sybil attacks during the task matching, and propose a privacy-preserving task matching scheme, called SybMatch. The SybMatch scheme can simultaneously protect the privacy of publishers and subscribers against semi-honest crowdsourcing service provider, and meanwhile support the sybil detection against greedy subscribers and efficient user revocation. Detailed security analysis and thorough performance evaluation show that the SybMatch scheme is secure and efficient

Efficient and Provably Secure Data Selective Sharing and Acquisition in Cloud-Based Systems

Towards the large amount of data generated everyday, data selective sharing and acquisition is one of the most significant data services in cloud-based systems, which enables data owners to selectively share their data to some particular users, and users to selectively acquire some interested data. However, it is challenging to protect data security and user privacy during data selective sharing and selective acquisition, because cloud servers are curious about the data or user\u27s interests, and even send data to some unauthorized users or some uninterested users. In this paper, we propose an efficient and provably secure Data selective Sharing and Acquisition (sf DSA) scheme for cloud-based systems. Specifically, we first formulate a generic data selective sharing and acquisition problem in cloud-based systems by identifying several design goals in terms of correctness, soundness, security and efficiency. Then, we propose the sf DSA scheme to enable data owners to control the access of their data in a fine-grained manner, and enable users to refine the data acquisition without revealing their interests. Technically, a brand new cryptographic framework is developed to integrate attribute-based encryption with searchable encryption. Finally, we prove that the proposed sf DSA scheme is correct, sound, secure in the random oracle model, and efficient in practice

Privacy-Preserving Task Recommendation Services for Crowdsourcing

Crowdsourcing is a distributed computing paradigm that utilizes human intelligence or resources from a crowd of workers. Existing solutions of task recommendation in crowdsourcing may leak private and sensitive information about both tasks and workers. To protect privacy, information about tasks and workers should be encrypted before being outsourced to the crowdsourcing platform, which makes the task recommendation a challenging problem. In this paper, we propose a privacy-preserving task recommendation scheme (PPTR) for crowdsourcing, which achieves the task-worker matching while preserving both task privacy and worker privacy. In PPTR, we first exploit the polynomial function to express multiple keywords of task requirements and worker interests. Then, we design a key derivation method based on matrix decomposition, to realize the multi-keyword matching between multiple requesters and multiple workers. Through PPTR, user accountability and user revocation are achieved effectively and efficiently. Extensive privacy analysis and performance evaluation show that PPTR is secure and efficient

Collaborative Intrusion Detection for VANETs: A Deep Learning-Based Distributed SDN Approach

Vehicular Ad hoc Network (VANET) is an enabling technology to provide a variety of convenient services in intelligent transportation systems, and yet vulnerable to various intrusion attacks. Intrusion detection systems (IDSs) can mitigate the security threats by detecting abnormal network behaviours. However, existing IDS solutions are limited to detect abnormal network behaviors under local sub-networks rather than the entire VANET. To address this problem, we utilize deep learning with generative adversarial networks and explore distributed SDN to design a collaborative intrusion detection system (CIDS) for VANETs, which enables multiple SDN controllers jointly train a global intrusion detection model for the entire network without directly exchanging their sub-network flows. We prove the correctness of our CIDS in both IID (Independent Identically Distribution) and non-IID situations, and also evaluate its performance through both theoretical analysis and experimental evaluation on a real-world dataset. Detailed experimental results validate that our CIDS is efficient and effective in intrusion detection for VANETs.This work was supported in part by the Key-Area Research and Development Program of Guangdong Province under Grant 2019B010136001, in part by the Natural Science Foundation of China under Grant 61732022 and Grant 61672195, and in part by the Peng Cheng Laboratory Project of Guangdong Province under Grant PCL2018KP004 and Grant PCL2018KP005. The Associate Editor for this article was N. Kumar. (Corresponding author: Weizhe Zhang.) Jiangang Shu is with the Cyberspace Security Research Center, Peng Cheng Laboratory, Shenzhen 518000, China (e-mail: [email protected])